On the Andrews-Curtis equivalence

نویسندگان

  • Alexei D. Myasnikov
  • Alexei G. Myasnikov
  • Vladimir Shpilrain
چکیده

The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of \elementary transformations" which are Nielsen transformations augmented by arbitrary conjugations. It is a prevalent opinion that this conjecture is false; however, not many potential counterexamples are known. In this paper, we show that some of the previously proposed examples are actually not counterexamples. We hope that the tricks we used in constructing relevant chains of elementary transformations will be useful to those who attempt to establish the Andrews-Curtis equivalence in other situations. On the other hand, we give two rather general and simple methods for constructing balanced presentations of the trivial group; some of these presentations can be considered potential counterexamples to the Andrews-Curtis conjecture. One of the methods is based on a simple combinatorial idea of composition of group presentations, whereas the other one uses \exotic" knot diagrams of the unknot. We also consider the Andrews-Curtis equivalence in metabelian groups and reveal some interesting connections of relevant problems to well-known problems in K-theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Finitary Andrews-Curtis Conjecture

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent importance for computational group theory. It also resolves a question asked in [5] and shows that a computation in finite groups cannot lead to a counterexam...

متن کامل

The Andrews-Curtis Conjecture and Black Box Groups

The paper discusses the Andrews-Curtis graph ∆k(G,N) of a normal subgroup N in a group G. The vertices of the graph are k-tuples of elements in N which generate N as a normal subgroup; two vertices are connected if one them can be obtained from another by certain elementary transformations. This object appears naturally in the theory of black box finite groups and in the Andrews-Curtis conjectu...

متن کامل

Andrews-Curtis and Todd-Coxeter proof words

Andrews and Curtis have conjectured that every balanced presentation of the trivial group can be transformed into a standard presentation by a finite sequence of elementary transformations. It can be difficult to determine whether or not the conjecture holds for a particular presentation. We show that the utility PEACE, which produces proofs based on Todd-Coxeter coset enumeration, can produce ...

متن کامل

Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture

The Andrews-Curtis conjecture states that every balanced presentation of the trivial group can be reduced to the standard one by a sequence of the elementary Nielsen transformations and conjugations. In this paper we describe all balanced presentations of the trivial group on two generators and with the total length of relators ≤ 12. We show that all these presentations satisfy the Andrews-Curt...

متن کامل

On Rourke’s Extension of Group Presentations and a Cyclic Version of the Andrews–curtis Conjecture

In 1979, Rourke proposed to extend the set of cyclically reduced defining words of a group presentation P by using operations of cyclic permutation, inversion and taking double products. He proved that iterations of these operations yield all cyclically reduced words of the normal closure of defining words of P if the group, defined by the presentation P, is trivial. We generalize this result b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006